A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method for Solving Linear Programming Problems with Fuzzy Parameters Based on Multiobjective Linear Programming Technique

In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters (FLP). Then by using the concept of comparison of fuzzy numbers we transform FLP problem into a multiobjective linear programming (MOLP) problem. T...

متن کامل

Defuzzification Method for Solving ‎Fuzzy ‎Linear Programming Problems

Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asia-Pacific Journal of Operational Research

سال: 2007

ISSN: 0217-5959,1793-7019

DOI: 10.1142/s0217595907001395